Lorentz Integral Transform for Inclusive and Exclusive Cross Sections with the Lanczos Method

The Lorentz Integral Transform (LIT) method is reformulated via the Lanczos algorithm both for inclusive and exclusive reactions. The new technique is tested for the total photoabsorption cross section of 3H and 4He. Due to the rapid convergence of the algorithm one has a decrease in cpu time by two orders of magnitude, but at the same time an excellent agreement with the results of a conventional LIT calculation. The present work opens up the possibility of ab initio calculations for inclusive and exclusive processes for A greater equal 6 with inclusion of complete final state interactions.Comment: LaTeX, 13 pages, 3 ps figure

Standardised Assessment of a General English Course

Article信州大学人文社会科学研究 1: 164-184(2007)departmental bulletin pape

CALL Implementation Strategies：A Case Study

This paper will begin by discussing changes in CALL (Computer Assisted Language Learning) over the past decade, identifying three modes: computers as teachers; computers used for communication between teachers and students; and communication among students. Next, we will investigate how key components of the Moodle LMS (Learning Management System), such as quizzes, forums and wikis can contribute to language acquisition by facilitating comprehensible input through task-based, communicative learning. We will also show how these approaches entail an avoidance of the product approach to language instruction which tends to facilitate language knowledge rather than acquisition. A practical discussion of these issues in our context will follow, also addressing the issue of assessment.Article信州大学人文社会科学研究 4: 135-151(2010)departmental bulletin pape

PROGETTO COSTRUTTIVO DI UN CAMBIO BOBINA PER SVOLGITORE DI CARTOTECNICA

Il presente studio è stato sviluppato nell’ambito della progettazione meccanica e si è svolto in collaborazione con l’azienda CRC s.r.l. di Marlia (LU). L’azienda ospitante opera nel settore della progettazione e servizi, studia, progetta, realizza e assembla, anche per conto di terzi, parti di macchinari ed impianti industriali appartenenti a vari settori, principalmente settore cartario. Inoltre è presente sul mercato con una gamma di prodotti propri per cartotecnica e cartiera finalizzati a migliorare la gestione del processo produttivo. Il lavoro svolto in questi mesi riguarda il miglioramento delle performance dello svolgitore bobina, la prima macchina che compone la linea di cartotecnica tramite installazione di un dispositivo automatizzato per scambiare la bobina di alimentazione della carta. Partendo dalla situazione attuale, dai layout e dalle performance si passa poi allo studio di fattibilità e alla valutazione economica, per poi concentrarsi sulla progettazione delle verifiche dovute successivamente la realizzazione

Toward a general purpose software environment for timeline-based planning

Timeline-based Planning and Scheduling applications have been successfully deployed in various contexts. Often such applications use specific solving algorithms and cannot be easily applied for solving different kind of problems. Then, an open research issue for such planning modeling is the one of creating a software infrastructure with a controllable search engine. In this regard, this paper presents an attempt to synthesize such a software environment. The Extensible Planning and Scheduling Library (EPSL) evolves from the Timeline Representation Framework (APSI-TRF), a software environment supported by the European Space Agency. Goal of EPSL is to obtain a software architecture having the flexibility to focus on specific problem solving aspects. The paper is an initial report on this effort: it introduces the whole idea, then focuses on the definition of suitable heuristic functions, and presents experiments related to two domains generated by current applications

Synthesis and Structural Characterization of a Tetranuclear Zinc(II) Complex with P,P'-Diphenylmethylenediphosphinate (pcp) and 2,2'-Bipyridine (2,2'-bipy) Ligands

A new tetranuclear complex of zinc(II) with P,P′-diphenylmethylenediphosphinate and 2,2′- bipyridine ligands was synthesized. [(pcp)(2,2′-bipy)Zn (μ3-pcp)Zn (2,2′-bipy)]2 · 6H2O was characterized by elemental analysis, IR spectroscopy, thermogravimetric analysis and X-ray diffractometry. The structure consists of tetranuclear complexes connected through water hydrogen-bonding interactions in corrugated 2D layers. Two crystallographically independent zinc ions are in a distorted five-coordinate environment, being surrounded by three oxygen atoms of phosphinate groups (from two pcp ligands) and by two bipy nitrogen donors. Of the two independent pcp anions the first one utilizes all of its oxygen donors to coordinate one metal as bidentate and two metal atoms as a monodentate ligand, whereas the second one is only bidentate for one metal atom

Long-Term Evaluation of a Telepresence Robot for the Elderly: Methodology and Ecological Case Study

Telepresence robotic systems are proposed in different contexts and specifically in the area of social robotics for assisting older adults at home. Similarly to other robotic systems, such robots are often designed and then evaluated in laboratory settings for a limited period of time. Lab-based evaluations present limitations because they do not take into account the different challenges imposed by the fielding of robotic solutions into real contexts for longer periods. In order to perform long-term experiments in real ecological settings it is very important to define a structured approach to assess the impact of a prolonged and constant use of the telepresence robot. This paper proposes a methodology in the area of elderly people support, called MARTA, for M ultidimensional A ssessment of telepresence R obo T for older A dults. It introduces the main variables of interest as well as the instruments and administration timeline for assessing relevant changes that may occur over time. MARTA is also validated in a one year-long case study during which a telepresence robot, called Giraff, has been deployed and iteratively assessed. The paper also provides remarks on the technology readiness and suggestions for its improvements

Timelines Are Expressive Enough to Capture Action-Based Temporal Planning

Planning problems are usually expressed by specifying which actions can be performed to obtain a given goal. In temporal planning problems, actions come with a time duration and can overlap in time, which noticeably increase the complexity of the reasoning process. Action-based temporal planning has been thoroughly studied from the complexity-theoretic point of view, and has been proved to be EXPSPACE-complete in its general formulation. Conversely, timeline-based planning problems are represented as a collection of variables whose time-varying behavior is governed by a set of temporal constraints, called synchronization rules. Timelines provide a unified framework to reason about planning and execution under uncertainty. Timeline-based systems are being successfully employed in real-world complex tasks, but, in contrast to action-based planning, little is known on their computational complexity and expressiveness. In particular, a comparison of the expressiveness of the action- and timeline-based formalisms is still missing. This paper contributes a first step in this direction by proving the EXPSPACE-completeness of timeline-based planning with no temporal horizon and bounded temporal relations only. The result is shown via a reduction from action-based temporal planning, thus proving that timelines are expressive enough to capture it